<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<title>Disjoint Stable Set Problems - Formulations by Representatives and Combinatorial Solvers: DirectlyAddressedSets&lt; T &gt;::FilteredNodeIterator Class Reference</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="dynsections.js"></script>
<link href="search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="search/search.js"></script>
<script type="text/javascript">
  $(document).ready(function() { searchBox.OnSelectItem(0); });
</script>
<link href="doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
 <tbody>
 <tr style="height: 56px;">
  <td style="padding-left: 0.5em;">
   <div id="projectname">Disjoint Stable Set Problems - Formulations by Representatives and Combinatorial Solvers
   </div>
  </td>
 </tr>
 </tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.8.1.1 -->
<script type="text/javascript">
var searchBox = new SearchBox("searchBox", "search",false,'Search');
</script>
  <div id="navrow1" class="tabs">
    <ul class="tablist">
      <li><a href="index.html"><span>Main&#160;Page</span></a></li>
      <li class="current"><a href="annotated.html"><span>Classes</span></a></li>
      <li><a href="files.html"><span>Files</span></a></li>
      <li>
        <div id="MSearchBox" class="MSearchBoxInactive">
        <span class="left">
          <img id="MSearchSelect" src="search/mag_sel.png"
               onmouseover="return searchBox.OnSearchSelectShow()"
               onmouseout="return searchBox.OnSearchSelectHide()"
               alt=""/>
          <input type="text" id="MSearchField" value="Search" accesskey="S"
               onfocus="searchBox.OnSearchFieldFocus(true)" 
               onblur="searchBox.OnSearchFieldFocus(false)" 
               onkeyup="searchBox.OnSearchFieldChange(event)"/>
          </span><span class="right">
            <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a>
          </span>
        </div>
      </li>
    </ul>
  </div>
  <div id="navrow2" class="tabs2">
    <ul class="tablist">
      <li><a href="annotated.html"><span>Class&#160;List</span></a></li>
      <li><a href="classes.html"><span>Class&#160;Index</span></a></li>
      <li><a href="inherits.html"><span>Class&#160;Hierarchy</span></a></li>
      <li><a href="functions.html"><span>Class&#160;Members</span></a></li>
    </ul>
  </div>
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
     onmouseover="return searchBox.OnSearchSelectShow()"
     onmouseout="return searchBox.OnSearchSelectHide()"
     onkeydown="return searchBox.OnSearchSelectKey(event)">
<a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(0)"><span class="SelectionMark">&#160;</span>All</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(1)"><span class="SelectionMark">&#160;</span>Classes</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(2)"><span class="SelectionMark">&#160;</span>Files</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(3)"><span class="SelectionMark">&#160;</span>Functions</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(4)"><span class="SelectionMark">&#160;</span>Variables</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(5)"><span class="SelectionMark">&#160;</span>Typedefs</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(6)"><span class="SelectionMark">&#160;</span>Enumerations</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(7)"><span class="SelectionMark">&#160;</span>Enumerator</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(8)"><span class="SelectionMark">&#160;</span>Friends</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(9)"><span class="SelectionMark">&#160;</span>Macros</a></div>

<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<iframe src="javascript:void(0)" frameborder="0" 
        name="MSearchResults" id="MSearchResults">
</iframe>
</div>

<div id="nav-path" class="navpath">
  <ul>
<li class="navelem"><a class="el" href="classDirectlyAddressedSets.html">DirectlyAddressedSets</a></li><li class="navelem"><a class="el" href="classDirectlyAddressedSets_1_1FilteredNodeIterator.html">FilteredNodeIterator</a></li>  </ul>
</div>
</div><!-- top -->
<div class="header">
  <div class="summary">
<a href="#pub-methods">Public Member Functions</a> &#124;
<a href="#pro-methods">Protected Member Functions</a> &#124;
<a href="#pri-attribs">Private Attributes</a> &#124;
<a href="#friends">Friends</a>  </div>
  <div class="headertitle">
<div class="title">DirectlyAddressedSets&lt; T &gt;::FilteredNodeIterator Class Reference</div>  </div>
</div><!--header-->
<div class="contents">
<div class="dynheader">
Collaboration diagram for DirectlyAddressedSets&lt; T &gt;::FilteredNodeIterator:</div>
<div class="dyncontent">
<div class="center"><img src="classDirectlyAddressedSets_1_1FilteredNodeIterator__coll__graph.png" border="0" usemap="#DirectlyAddressedSets_3_01T_01_4_1_1FilteredNodeIterator_coll__map" alt="Collaboration graph"/></div>
<map name="DirectlyAddressedSets_3_01T_01_4_1_1FilteredNodeIterator_coll__map" id="DirectlyAddressedSets_3_01T_01_4_1_1FilteredNodeIterator_coll__map">
<area shape="rect" id="node2" href="classDirectlyAddressedSets_1_1BitMapIterators.html" title="DirectlyAddressedSets\l\&lt; T \&gt;::BitMapIterators" alt="" coords="77,203,232,250"/><area shape="rect" id="node4" href="classBitMapDirectlyAddressedSet_1_1BitMapIterator.html" title="An abstract implementation of DirectlyAddressedSet::Iterator." alt="" coords="60,105,249,151"/><area shape="rect" id="node6" href="classDirectlyAddressedSet_1_1Iterator.html" title="A general iterator to scan a DirectlyAddressedSet." alt="" coords="5,6,155,53"/><area shape="rect" id="node8" href="classBitTools.html" title="BitTools\&lt; T \&gt;" alt="" coords="179,15,280,44"/></map>
<center><span class="legend">[<a href="graph_legend.html">legend</a>]</span></center></div>

<p><a href="classDirectlyAddressedSets_1_1FilteredNodeIterator-members.html">List of all members.</a></p>
<table class="memberdecls">
<tr class="heading"><td colspan="2"><h2><a name="pub-methods"></a>
Public Member Functions</h2></td></tr>
<tr class="memitem:aeb7cf842870b8edb3e9bee2afdba8237"><td class="memItemLeft" align="right" valign="top">virtual&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classDirectlyAddressedSets_1_1FilteredNodeIterator.html#aeb7cf842870b8edb3e9bee2afdba8237">~FilteredNodeIterator</a> ()</td></tr>
<tr class="memitem:aeaaf0e2b4a7bf2aa980653dbf658ec7b"><td class="memItemLeft" align="right" valign="top">virtual T *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classDirectlyAddressedSets_1_1FilteredNodeIterator.html#aeaaf0e2b4a7bf2aa980653dbf658ec7b">nextNode</a> (long *i)</td></tr>
<tr class="memdesc:aeaaf0e2b4a7bf2aa980653dbf658ec7b"><td class="mdescLeft">&#160;</td><td class="mdescRight">Enumerates the first nonempty node in the set next to the current cursor position.  <a href="#aeaaf0e2b4a7bf2aa980653dbf658ec7b"></a><br/></td></tr>
<tr class="memitem:a83b7717858f2056f36c9f07180630a73"><td class="memItemLeft" align="right" valign="top">virtual T *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classDirectlyAddressedSets_1_1FilteredNodeIterator.html#a83b7717858f2056f36c9f07180630a73">nextNodeUpTo</a> (long to, long *i)</td></tr>
<tr class="memdesc:a83b7717858f2056f36c9f07180630a73"><td class="mdescLeft">&#160;</td><td class="mdescRight">Enumerates the first nonempty node in the set next to the current cursor position up to a specified value.  <a href="#a83b7717858f2056f36c9f07180630a73"></a><br/></td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2><a name="pro-methods"></a>
Protected Member Functions</h2></td></tr>
<tr class="memitem:a31557e7419daf2d3a41990cd8af8e243"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classDirectlyAddressedSets_1_1FilteredNodeIterator.html#a31557e7419daf2d3a41990cd8af8e243">FilteredNodeIterator</a> (<a class="el" href="classBitMapDirectlyAddressedSet.html">BitMapDirectlyAddressedSet</a>&lt; T &gt; *a, <a class="el" href="classBitMapDirectlyAddressedSet.html">BitMapDirectlyAddressedSet</a>&lt; T &gt; *b, <a class="el" href="classFilter.html">Filter</a>&lt; T &gt; *fil)</td></tr>
<tr class="memdesc:a31557e7419daf2d3a41990cd8af8e243"><td class="mdescLeft">&#160;</td><td class="mdescRight">The specified <a class="el" href="classBitMapDirectlyAddressedSet.html" title="A DirectlyAddressedSet implemented with an array of nodes, each node corresponding to a word of the s...">BitMapDirectlyAddressedSet</a> are assumed to be the same universe.  <a href="#a31557e7419daf2d3a41990cd8af8e243"></a><br/></td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2><a name="pri-attribs"></a>
Private Attributes</h2></td></tr>
<tr class="memitem:a35cbc8ec32d577cb096ff467d2304245"><td class="memItemLeft" align="right" valign="top">long&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classDirectlyAddressedSets_1_1FilteredNodeIterator.html#a35cbc8ec32d577cb096ff467d2304245">inode</a></td></tr>
<tr class="memdesc:a35cbc8ec32d577cb096ff467d2304245"><td class="mdescLeft">&#160;</td><td class="mdescRight">index of the node in the array  <a href="#a35cbc8ec32d577cb096ff467d2304245"></a><br/></td></tr>
<tr class="memitem:a1c30ee8d85d390f893aa585d3bd5b221"><td class="memItemLeft" align="right" valign="top">long&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classDirectlyAddressedSets_1_1FilteredNodeIterator.html#a1c30ee8d85d390f893aa585d3bd5b221">dspl</a></td></tr>
<tr class="memdesc:a1c30ee8d85d390f893aa585d3bd5b221"><td class="mdescLeft">&#160;</td><td class="mdescRight">first value in the current node  <a href="#a1c30ee8d85d390f893aa585d3bd5b221"></a><br/></td></tr>
<tr class="memitem:adc557005c43e633cfc494dfdc55c5b57"><td class="memItemLeft" align="right" valign="top">long&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classDirectlyAddressedSets_1_1FilteredNodeIterator.html#adc557005c43e633cfc494dfdc55c5b57">iu</a></td></tr>
<tr class="memitem:aac6d677494fe5c2c797934409bb1097a"><td class="memItemLeft" align="right" valign="top">const <br class="typebreak"/>
<a class="el" href="classBitMapDirectlyAddressedSet.html">BitMapDirectlyAddressedSet</a>&lt; T &gt; *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classDirectlyAddressedSets_1_1FilteredNodeIterator.html#aac6d677494fe5c2c797934409bb1097a">t</a></td></tr>
<tr class="memdesc:aac6d677494fe5c2c797934409bb1097a"><td class="mdescLeft">&#160;</td><td class="mdescRight">the enclosing BitMapDirectlyAddressedSet&lt;T&gt;, which gives access to BitMapDirectlyAddressedSet&lt;T&gt;::treeNode method  <a href="#aac6d677494fe5c2c797934409bb1097a"></a><br/></td></tr>
<tr class="memitem:a8871feb139ee31e3cf81c1ca9aeadcbe"><td class="memItemLeft" align="right" valign="top">const <a class="el" href="classFilter.html">Filter</a>&lt; T &gt; *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classDirectlyAddressedSets_1_1FilteredNodeIterator.html#a8871feb139ee31e3cf81c1ca9aeadcbe">f</a></td></tr>
<tr class="memdesc:a8871feb139ee31e3cf81c1ca9aeadcbe"><td class="mdescLeft">&#160;</td><td class="mdescRight">the filter  <a href="#a8871feb139ee31e3cf81c1ca9aeadcbe"></a><br/></td></tr>
<tr class="memitem:a91425857549adf95883433412d8838ad"><td class="memItemLeft" align="right" valign="top">const <a class="el" href="classDirectlyAddressedSets_1_1BitMapIterators.html">BitMapIterators</a> *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classDirectlyAddressedSets_1_1FilteredNodeIterator.html#a91425857549adf95883433412d8838ad">fiter</a></td></tr>
<tr class="memdesc:a91425857549adf95883433412d8838ad"><td class="mdescLeft">&#160;</td><td class="mdescRight">the BitMapDirectlyAddressedSet&lt;T&gt; used to filter  <a href="#a91425857549adf95883433412d8838ad"></a><br/></td></tr>
<tr class="memitem:afd8d29eddffe74b864cfc5b6d6f9d0e0"><td class="memItemLeft" align="right" valign="top">T&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classDirectlyAddressedSets_1_1FilteredNodeIterator.html#afd8d29eddffe74b864cfc5b6d6f9d0e0">fnode</a></td></tr>
<tr class="memdesc:afd8d29eddffe74b864cfc5b6d6f9d0e0"><td class="mdescLeft">&#160;</td><td class="mdescRight">filtered node  <a href="#afd8d29eddffe74b864cfc5b6d6f9d0e0"></a><br/></td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2><a name="friends"></a>
Friends</h2></td></tr>
<tr class="memitem:a71b5593612d613cafdf655d85b684ea3"><td class="memItemLeft" align="right" valign="top">class&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classDirectlyAddressedSets_1_1FilteredNodeIterator.html#a71b5593612d613cafdf655d85b684ea3">DirectlyAddressedSets</a></td></tr>
</table>
<hr/><h2>Constructor &amp; Destructor Documentation</h2>
<a class="anchor" id="a31557e7419daf2d3a41990cd8af8e243"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename T &gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname"><a class="el" href="classDirectlyAddressedSets.html">DirectlyAddressedSets</a>&lt; T &gt;::FilteredNodeIterator::FilteredNodeIterator </td>
          <td>(</td>
          <td class="paramtype"><a class="el" href="classBitMapDirectlyAddressedSet.html">BitMapDirectlyAddressedSet</a>&lt; T &gt; *&#160;</td>
          <td class="paramname"><em>a</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype"><a class="el" href="classBitMapDirectlyAddressedSet.html">BitMapDirectlyAddressedSet</a>&lt; T &gt; *&#160;</td>
          <td class="paramname"><em>b</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype"><a class="el" href="classFilter.html">Filter</a>&lt; T &gt; *&#160;</td>
          <td class="paramname"><em>fil</em>&#160;</td>
        </tr>
        <tr>
          <td></td>
          <td>)</td>
          <td></td><td></td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span><span class="mlabel">protected</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p>The specified <a class="el" href="classBitMapDirectlyAddressedSet.html" title="A DirectlyAddressedSet implemented with an array of nodes, each node corresponding to a word of the s...">BitMapDirectlyAddressedSet</a> are assumed to be the same universe. </p>

</div>
</div>
<a class="anchor" id="aeb7cf842870b8edb3e9bee2afdba8237"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename T&gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">virtual <a class="el" href="classDirectlyAddressedSets.html">DirectlyAddressedSets</a>&lt; T &gt;::FilteredNodeIterator::~FilteredNodeIterator </td>
          <td>(</td>
          <td class="paramname"></td><td>)</td>
          <td></td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span><span class="mlabel">virtual</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

</div>
</div>
<hr/><h2>Member Function Documentation</h2>
<a class="anchor" id="aeaaf0e2b4a7bf2aa980653dbf658ec7b"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename T &gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">T * <a class="el" href="classDirectlyAddressedSets.html">DirectlyAddressedSets</a>&lt; T &gt;::FilteredNodeIterator::nextNode </td>
          <td>(</td>
          <td class="paramtype">long *&#160;</td>
          <td class="paramname"><em>i</em></td><td>)</td>
          <td></td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span><span class="mlabel">virtual</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p>Enumerates the first nonempty node in the set next to the current cursor position. </p>
<p>This method advances the cursor to the end of the returned node. This method may be called repeatedly to traverse the nodes of the set in ascending order.</p>
<dl class="params"><dt>Parameters:</dt><dd>
  <table class="params">
    <tr><td class="paramname">i</td><td>the index of the node returned, if there is one, or a value greater than or equal to the number of nodes otherwise</td></tr>
  </table>
  </dd>
</dl>
<dl class="section return"><dt>Returns:</dt><dd>the next node to be enumerated, if there is one, or an arbitrary pointer otherwise </dd></dl>

</div>
</div>
<a class="anchor" id="a83b7717858f2056f36c9f07180630a73"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename T &gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">T * <a class="el" href="classDirectlyAddressedSets.html">DirectlyAddressedSets</a>&lt; T &gt;::FilteredNodeIterator::nextNodeUpTo </td>
          <td>(</td>
          <td class="paramtype">long&#160;</td>
          <td class="paramname"><em>to</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">long *&#160;</td>
          <td class="paramname"><em>i</em>&#160;</td>
        </tr>
        <tr>
          <td></td>
          <td>)</td>
          <td></td><td></td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span><span class="mlabel">virtual</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p>Enumerates the first nonempty node in the set next to the current cursor position up to a specified value. </p>
<p>This method advances the cursor to the end of the returned node. This method may be called repeatedly to traverse the set in ascending order. In special, this method is useful to enumerate a particular node of a level of a tree of bitmaps.</p>
<p>This method differs from next() in the sense it stops searching for the next node when the specified limit is reached. If there is no next key in the current set up to the specified value, then the new cursor position is unpredictable. In this case, a call to restart() or restartFrom(long) must be performed before any call to enumeration methods.</p>
<dl class="params"><dt>Parameters:</dt><dd>
  <table class="params">
    <tr><td class="paramname">to</td><td>the value to limit the enumeration </td></tr>
    <tr><td class="paramname">i</td><td>the index of the node returned, if there is one, or a value greater than or equal to the number of nodes otherwise</td></tr>
  </table>
  </dd>
</dl>
<dl class="section return"><dt>Returns:</dt><dd>the next node to be enumerated up to the specified value, if there is one, or an arbitrary pointer otherwise </dd></dl>

</div>
</div>
<hr/><h2>Friends And Related Function Documentation</h2>
<a class="anchor" id="a71b5593612d613cafdf655d85b684ea3"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename T&gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">friend class <a class="el" href="classDirectlyAddressedSets.html">DirectlyAddressedSets</a></td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">friend</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

</div>
</div>
<hr/><h2>Member Data Documentation</h2>
<a class="anchor" id="a1c30ee8d85d390f893aa585d3bd5b221"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename T&gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">long <a class="el" href="classDirectlyAddressedSets.html">DirectlyAddressedSets</a>&lt; T &gt;::FilteredNodeIterator::dspl</td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">private</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p>first value in the current node </p>

</div>
</div>
<a class="anchor" id="a8871feb139ee31e3cf81c1ca9aeadcbe"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename T&gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">const <a class="el" href="classFilter.html">Filter</a>&lt;T&gt;* <a class="el" href="classDirectlyAddressedSets.html">DirectlyAddressedSets</a>&lt; T &gt;::FilteredNodeIterator::f</td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">private</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p>the filter </p>

</div>
</div>
<a class="anchor" id="a91425857549adf95883433412d8838ad"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename T&gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">const <a class="el" href="classDirectlyAddressedSets_1_1BitMapIterators.html">BitMapIterators</a>* <a class="el" href="classDirectlyAddressedSets.html">DirectlyAddressedSets</a>&lt; T &gt;::FilteredNodeIterator::fiter</td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">private</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p>the BitMapDirectlyAddressedSet&lt;T&gt; used to filter </p>

</div>
</div>
<a class="anchor" id="afd8d29eddffe74b864cfc5b6d6f9d0e0"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename T&gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">T <a class="el" href="classDirectlyAddressedSets.html">DirectlyAddressedSets</a>&lt; T &gt;::FilteredNodeIterator::fnode</td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">private</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p>filtered node </p>

</div>
</div>
<a class="anchor" id="a35cbc8ec32d577cb096ff467d2304245"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename T&gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">long <a class="el" href="classDirectlyAddressedSets.html">DirectlyAddressedSets</a>&lt; T &gt;::FilteredNodeIterator::inode</td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">private</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p>index of the node in the array </p>

</div>
</div>
<a class="anchor" id="adc557005c43e633cfc494dfdc55c5b57"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename T&gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">long <a class="el" href="classDirectlyAddressedSets.html">DirectlyAddressedSets</a>&lt; T &gt;::FilteredNodeIterator::iu</td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">private</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

</div>
</div>
<a class="anchor" id="aac6d677494fe5c2c797934409bb1097a"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename T&gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">const <a class="el" href="classBitMapDirectlyAddressedSet.html">BitMapDirectlyAddressedSet</a>&lt;T&gt;* <a class="el" href="classDirectlyAddressedSets.html">DirectlyAddressedSets</a>&lt; T &gt;::FilteredNodeIterator::t</td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">private</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p>the enclosing BitMapDirectlyAddressedSet&lt;T&gt;, which gives access to BitMapDirectlyAddressedSet&lt;T&gt;::treeNode method </p>

</div>
</div>
<hr/>The documentation for this class was generated from the following file:<ul>
<li>datastruct/<a class="el" href="DirectlyAddressedSets_8cpp.html">DirectlyAddressedSets.cpp</a></li>
</ul>
</div><!-- contents -->
<!-- start footer part -->
<hr class="footer"/><address class="footer"><small>
Generated on Wed Nov 14 2012 14:53:57 for Disjoint Stable Set Problems - Formulations by Representatives and Combinatorial Solvers by &#160;<a href="http://www.doxygen.org/index.html">
<img class="footer" src="doxygen.png" alt="doxygen"/>
</a> 1.8.1.1
</small></address>
</body>
</html>
